Proofs for traffic safety - combining diagrams and logic
نویسنده
چکیده
Due to the increasing interest in autonomously driving cars, safety issues of such systems are of utmost importance. Safety in this sense is primarily the absence of collisions, which is inherently a spatial property. Within computer science, typical models of cars include specifications of their behaviour, where the space a car needs for operating safely is a function of time. This complicates proofs of safety properties tremendously. In this thesis, we present methods to separate reasoning on space from the dynamical behaviour of cars. To that end, we define an abstract model with an emphasis on spatial transformations of the situation on the road. Based on this model, we develop two formalisms: We give the definitions of a modal logic suited to reason about safety properties of arbitrarily many cars. Furthermore, we present a diagrammatic language to ease the specification of such properties. We formally prove that no collisions arise between cars obeying a small set of requirements.
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملAutomatic Construction of Hoare Proofs from Abstract Interpretation Results
Interpretation Results Sunae Seo, Hongseok Yang, and Kwangkeun Yi 1 Department of Computer Science, Korea Advanced Institute of Science and Technology [email protected] 2 MICROS Research Center, Korea Advanced Institute of Science and Technology [email protected] 3 School of Computer Science and Engineering, Seoul National University [email protected] Abstract. By combining program lo...
متن کاملProof Diagrams for Multiplicative Linear Logic: Syntax and Semantics
Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative 2-dimensional syntax for multiplicative linear logic derivations. The syntax of string diagrams authorizes the definition of a framework where the sequentializabi...
متن کاملConstructing internal diagrammatic proofs from external logic diagrams
Internal syntactic operations on diagrams play a key role in accounting for efficacy of diagram use in reasoning. However, it is often held that in the case of complex deductive reasoning, diagrams can serve merely as an auxiliary source of information in interpreting sentences or constructing models. Based on experiments comparing subjects’ performances in syllogism solving where logic diagram...
متن کاملTLA in Pictures
Predicate-action diagrams, which are similar to standard state-transition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specification—and those descriptions then proved correct— even when the complete specification cannot be written as a diagram. We also use the diagrams to illustrate proofs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 01-15 شماره
صفحات -
تاریخ انتشار 2015